regular grammar造句
例句与造句
- Lex and yacc can be used to parse fairly simple and regular grammars
Lex和yacc可以用来解析相当简单和规则的语法。 - The paper describes symbolic structure of word of program language with regular grammar and regular expression , constructs converted - state chart to identify word symbol
用正规文法和正规表达式描述了程序语言的单词符号的结构，用状态转换图构造了识别单词符号。 - Lastly , we obtain a key theorem which charactarize the link between computing with words via lattice - valued finite automata and computing with numbers via lattice - valued finite automata . 2 . lattice - valued regular grammar
最后,严格证明了一个刻画基于格值有限状态自动机的数值计算和基于格值有限状态自动机的词计算之间的联系的一个基本定理。 - At last , we also obtain a key theorem which charactarize the link between computing with words via lattice - valued regular grammar and computing with values via lattice - valued regular grammar . 3 . the equivalence between two kinds of lattice - valued models
最后,严格证明了一个刻画基于格值正则文法的词计算和基于格值正则文法的数值计算之间的联系的一个基本定理。 - We propose the concept of lattice - valued ( hyper - ) regular grammar as well as lattice - valued ( hyper - ) regular language . moreover , we give the concept of the equivalence between two lattice - valued grammars . then we proved that every lattice - valued regular language is a lattice - valued hyper - regular language
2 .格值正则文法的研究:首先,提出了格值(超)正则文法的概念,并给出了格值(超)正则语言的定义,同时给出了两个格值文法等价的刻画。 - It's difficult to find regular grammar in a sentence. 用regular grammar造句挺难的
- Based on lotfi a . zadeh ’ s work , mingsheng ying ’ s work and daowen qiu ’ s work , the author proposed two new formal models of computing with words , namely the formal model of computing with words via lattice - valued finite state automata and the formal model of computing with words via lattice - valued regular grammar . the formal model of computing with words is expored and investigated
本文在lotfia . zadeh教授、应明生教授、邱道文教授等人的工作基础上,提出了词计算的两种新的形式模型? ?基于格值有限状态自动机的词计算形式模型和基于格值正则文法的词计算形式模型,对词计算的形式模型作了进一步研究和探讨。